Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation
نویسندگان
چکیده
منابع مشابه
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). The execution of all tasks of a DFG is called an iteration, with the average computation time of an iteration the iteration period. A great deal of research has been done attempting to optimize such applicatio...
متن کاملExtended retiming: optimal scheduling via a graph-theoretical approach
Many iterative or recursive applications commonly found in DSP and image processing applications can be represented by data-flow graphs (DFGs). This graph is then used to perform DFG scheduling, where the starting times for executing the application’s individual tasks are determined. The minimum length of time required to execute all tasks once is called the schedule length of the DFG. A great ...
متن کاملGraph Transformation for Communication Minimization Using Retiming
Nested loops are normally the most time intensive tasks in computer algorithms. These loops often include multiple dependencies between arrays that impose communication constraints when used in multiprocessor systems. These dependencies may be between dependent arrays (loop dependencies), or between independent arrays (data dependencies). In this paper, reducing the communication caused by data...
متن کاملUnfolding semantics of graph transformation
Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, but only partial results were obtained. In this paper we fully extend Winskel’s approach to single-pushout grammars providing them with a categorical concurrent semantics expressed as a coreflection between the category of (semi-weighted) graph grammars a...
متن کاملTowards Unfolding-Based Verification for Graph Transformation Systems
The unfolding semantics of graph transformation systems can represent a basis for their formal verification. For general, possibly infinite-state, graph transformation systems one can construct finite underand overapproximations of the (infinite) unfolding, with arbitrary accuracy. Such approximations can be used to check properties of a graph transformation system, like safety and liveness pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of VLSI signal processing systems for signal, image and video technology
سال: 2005
ISSN: 0922-5773
DOI: 10.1007/s11265-005-4845-6